Efficient Rank Reduction of Correlation Matrices
نویسندگان
چکیده
منابع مشابه
Correlation Clustering with Low-Rank Matrices
Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled ‘similar’ or ‘dissimilar.’ Because the optimization problem is NP-hard, much of the previous literature focuses on finding approximation algorithms. In this paper we explore how to solve the correlation clustering objective exactly when the data to be clustered ca...
متن کاملA Note on Correlation and Rank Reduction
We review both full-rank and reduced-rank parameterizations for correlation matrices. In particular, the full-rank parameterizations of Rebonato (1999d) and Schoenmakers and Coffey (2000), the reduced-rank angle parameterization of Rebonato (1999d) and Rebonato and Jäckel (1999), and the well known zeroed-eigenvalues reduced-rank approximation are described in detail. Numerical examples are pro...
متن کاملOn higher rank numerical hulls of normal matrices
In this paper, some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated. A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given. Moreover, using the extreme points of the numerical range, the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$, where $A_1...
متن کاملRank-based Tapering Estimation of Bandable Correlation Matrices
The nonparanormal model assumes that variables follow a multivariate normal distribution after a set of unknown monotone increasing transformations. It is a flexible generalization of the normal model but retains the nice interpretability of the latter. In this paper we propose a rank-based tapering estimator for estimating the correlation matrix in the nonparanormal model in which the variable...
متن کاملPainless Breakups - Efficient Demixing of Low Rank Matrices
Assume we are given a sum of linear measurements of s different rank-r matrices of the form y = ∑s k=1Ak(Xk). When and under which conditions is it possible to extract (demix) the individual matrices Xk from the single measurement vector y? And can we do the demixing numerically efficiently? We present two computationally efficient algorithms based on hard thresholding to solve this low rank de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2005
ISSN: 1556-5068
DOI: 10.2139/ssrn.518563